On Collatz Words, Sequences, and Trees
نویسنده
چکیده
Motivated by recent work of Trümper, we consider the general Collatz word (updown pattern) and the sequences following this pattern. We derive recurrences for the first and last sequence entries from repeated application of the general solution of a binary linear inhomogeneous Diophantine equation. We solve these recurrences and also discuss the Collatz tree.
منابع مشابه
Quantitative Comparison of Tree Pairs Resulted from Gene and Protein Phylogenetic Trees for Sulfite Reductase Flavoprotein Alpha-Component and 5S rRNA and Taxonomic Trees in Selected Bacterial Species
Introduction: FAD is the cofactor of FAD-FR protein family. Sulfite reductase flavoprotein alpha-component is one of the main enzymes of this family. Based on applications of this enzyme in biotechnology and industry, it was chosen as the subject of evolutionary studies in 19 specific species. Method: Gene and protein sequences of sulfite reductase flavoprotein alpha-component, 5S rRNA sequence...
متن کاملQuantitative Comparison of Tree Pairs Resulted from Gene and Protein Phylogenetic Trees for Sulfite Reductase Flavoprotein Alpha-Component and 5S rRNA and Taxonomic Trees in Selected Bacterial Species
Introduction: FAD is the cofactor of FAD-FR protein family. Sulfite reductase flavoprotein alpha-component is one of the main enzymes of this family. Based on applications of this enzyme in biotechnology and industry, it was chosen as the subject of evolutionary studies in 19 specific species. Method: Gene and protein sequences of sulfite reductase flavoprotein alpha-component, 5S rRNA sequence...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملOdd Collatz Sequence and Binary Representations
Here we investigate the odd numbers in Collatz sequences (sequences arising from the 3n+1 problem). We are especially interested in methods in binary number representations of the numbers in the sequence. In the first section, we show some results for odd Collatz sequences using mostly binary arithmetics. We see how some results become more obvious in binary arithmetic than in usual method of c...
متن کاملTernary Modified Collatz Sequences And Jacobsthal Numbers
We show how to apply the Collatz function and the modified Collatz function to the ternary representation of a positive integer, and we present the ternary modified Collatz sequence starting with a multiple of 3N for an arbitrary large integer N . Each ternary string in the sequence is shown to have a repeating string, and the number of occurrences of each digit in each repeating string is iden...
متن کامل